Planning and Scheduling for Fleets of Earth Observing Satellites

Vve address the problem of scheduling observations for a collection of earth observing satellites. This scheduling task is a difficult optimization problem, potentially involving many satellites, hundreds of requests, constraints on when and how to service each request, and resources such as instruments, recording devices, transmitters, and ground stations. High-fidelity models are required to ensure the validity of schedules; at the same time, the size and complexity of the problem makes it unlikely that systematic optimization search methods will be able to solve them in a re_onable time. This paper presents a constraint-based approach to solving the EOS scheduling problem, and proposes a stochastic heuristic search method for solving it.